0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.33	% Computer   : n007.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 12:45:49 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.33	% Number of cores: 8
0.12/0.34	% Python version: Python 3.6.8
0.12/0.34	# Version: 2.6rc1-ho
0.12/0.34	# No SInE strategy applied
0.12/0.34	# Trying AutoSched0 for 59 seconds
0.19/0.37	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
0.19/0.37	# and selection function SelectMaxLComplexAvoidPosPred.
0.19/0.37	#
0.19/0.37	# Preprocessing time       : 0.028 s
0.19/0.37	# Presaturation interreduction done
0.19/0.37	
0.19/0.37	# Proof found!
0.19/0.37	# SZS status Theorem
0.19/0.37	# SZS output start CNFRefutation
0.19/0.37	thf(ca, axiom, setunion @ c @ a, file('/export/starexec/sandbox/benchmark/theBenchmark.p', ca)).
0.19/0.37	thf(setuniond, axiom, (setunion)=(^[X1:($i > $o) > $o, X2:$i]:?[X3:$i > $o]:(X1 @ X3&X3 @ X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setuniond)).
0.19/0.37	thf(choiceax, axiom, ![X6:$i > $o]:(?[X2:$i]:X6 @ X2=>X6 @ (eps @ X6)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', choiceax)).
0.19/0.37	thf(conj, conjecture, (c @ (choosenonempty @ c)&?[X2:$i]:choosenonempty @ c @ X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)).
0.19/0.37	thf(choosenonemptyd, axiom, (choosenonempty)=(^[X1:($i > $o) > $o]:epsio @ (^[X3:$i > $o]:(X1 @ X3&X3 @ (eps @ X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', choosenonemptyd)).
0.19/0.37	thf(choiceaxio, axiom, ![X4:($i > $o) > $o]:(X4 @ (epsio @ X4)<=?[X5:$i > $o]:X4 @ X5), file('/export/starexec/sandbox/benchmark/theBenchmark.p', choiceaxio)).
0.19/0.37	thf(c_0_6, plain, ?[X12:$i > $o]:(c @ X12&X12 @ a), inference(apply_def,[status(thm)],[ca, setuniond])).
0.19/0.37	thf(c_0_7, plain, ![X13:$i > $o]:(epred1_1 @ X13<=>(c @ X13&X13 @ (eps @ X13))), introduced(definition)).
0.19/0.37	thf(c_0_8, plain, ![X18:$i > $o, X19:$i]:(~X18 @ X19|X18 @ (eps @ X18)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])).
0.19/0.37	thf(c_0_9, plain, (c @ epred2_0&epred2_0 @ a), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])).
0.19/0.37	thf(c_0_10, negated_conjecture, ~((c @ (epsio @ epred1_1)&?[X2:$i]:epsio @ epred1_1 @ X2)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), choosenonemptyd]), c_0_7]), c_0_7])).
0.19/0.37	thf(c_0_11, plain, ![X4:($i > $o) > $o]:(?[X5:$i > $o]:X4 @ X5=>X4 @ (epsio @ X4)), inference(fof_simplification,[status(thm)],[choiceaxio])).
0.19/0.37	thf(c_0_12, plain, ![X21:$i > $o]:(((c @ X21|~epred1_1 @ X21)&(X21 @ (eps @ X21)|~epred1_1 @ X21))&(~c @ X21|~X21 @ (eps @ X21)|epred1_1 @ X21)), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
0.19/0.37	thf(c_0_13, plain, ![X3:$i > $o, X2:$i]:(X3 @ (eps @ X3)|~X3 @ X2), inference(split_conjunct,[status(thm)],[c_0_8])).
0.19/0.37	thf(c_0_14, plain, epred2_0 @ a, inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.37	thf(c_0_15, negated_conjecture, ![X20:$i]:(~c @ (epsio @ epred1_1)|~epsio @ epred1_1 @ X20), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
0.19/0.37	thf(c_0_16, plain, ![X15:($i > $o) > $o, X16:$i > $o]:(~X15 @ X16|X15 @ (epsio @ X15)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
0.19/0.37	thf(c_0_17, plain, ![X3:$i > $o]:(epred1_1 @ X3|~c @ X3|~X3 @ (eps @ X3)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.19/0.37	thf(c_0_18, plain, epred2_0 @ (eps @ epred2_0), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.19/0.37	thf(c_0_19, plain, c @ epred2_0, inference(split_conjunct,[status(thm)],[c_0_9])).
0.19/0.37	thf(c_0_20, negated_conjecture, ![X2:$i]:(~c @ (epsio @ epred1_1)|~epsio @ epred1_1 @ X2), inference(split_conjunct,[status(thm)],[c_0_15])).
0.19/0.37	thf(c_0_21, plain, ![X3:$i > $o]:(c @ X3|~epred1_1 @ X3), inference(split_conjunct,[status(thm)],[c_0_12])).
0.19/0.37	thf(c_0_22, plain, ![X1:($i > $o) > $o, X3:$i > $o]:(X1 @ (epsio @ X1)|~X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_16])).
0.19/0.37	thf(c_0_23, plain, epred1_1 @ epred2_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])])).
0.19/0.37	thf(c_0_24, plain, ![X2:$i]:(~epred1_1 @ (epsio @ epred1_1)|~epsio @ epred1_1 @ X2), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.19/0.37	thf(c_0_25, plain, epred1_1 @ (epsio @ epred1_1), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.19/0.37	thf(c_0_26, plain, ![X2:$i]:~epsio @ epred1_1 @ X2, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_25])])).
0.19/0.37	thf(c_0_27, plain, ![X3:$i > $o]:(X3 @ (eps @ X3)|~epred1_1 @ X3), inference(split_conjunct,[status(thm)],[c_0_12])).
0.19/0.37	thf(c_0_28, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_25])]), ['proof']).
0.19/0.37	# SZS output end CNFRefutation
0.19/0.37	# Proof object total steps             : 29
0.19/0.37	# Proof object clause steps            : 14
0.19/0.37	# Proof object formula steps           : 15
0.19/0.37	# Proof object conjectures             : 4
0.19/0.37	# Proof object clause conjectures      : 1
0.19/0.37	# Proof object formula conjectures     : 3
0.19/0.37	# Proof object initial clauses used    : 8
0.19/0.37	# Proof object initial formulas used   : 6
0.19/0.37	# Proof object generating inferences   : 5
0.19/0.37	# Proof object simplifying inferences  : 6
0.19/0.37	# Training examples: 0 positive, 0 negative
0.19/0.37	# Parsed axioms                        : 12
0.19/0.37	# Removed by relevancy pruning/SinE    : 0
0.19/0.37	# Initial clauses                      : 14
0.19/0.37	# Removed in clause preprocessing      : 6
0.19/0.37	# Initial clauses in saturation        : 8
0.19/0.37	# Processed clauses                    : 42
0.19/0.37	# ...of these trivial                  : 1
0.19/0.37	# ...subsumed                          : 0
0.19/0.37	# ...remaining for further processing  : 41
0.19/0.37	# Other redundant clauses eliminated   : 0
0.19/0.37	# Clauses deleted for lack of memory   : 0
0.19/0.37	# Backward-subsumed                    : 0
0.19/0.37	# Backward-rewritten                   : 5
0.19/0.37	# Generated clauses                    : 44
0.19/0.37	# ...of the previous two non-trivial   : 40
0.19/0.37	# Contextual simplify-reflections      : 4
0.19/0.37	# Paramodulations                      : 18
0.19/0.37	# Factorizations                       : 0
0.19/0.37	# NegExts                              : 7
0.19/0.37	# Equation resolutions                 : 0
0.19/0.37	# Propositional unsat checks           : 0
0.19/0.37	#    Propositional check models        : 0
0.19/0.37	#    Propositional check unsatisfiable : 0
0.19/0.37	#    Propositional clauses             : 0
0.19/0.37	#    Propositional clauses after purity: 0
0.19/0.37	#    Propositional unsat core size     : 0
0.19/0.37	#    Propositional preprocessing time  : 0.000
0.19/0.37	#    Propositional encoding time       : 0.000
0.19/0.37	#    Propositional solver time         : 0.000
0.19/0.37	#    Success case prop preproc time    : 0.000
0.19/0.37	#    Success case prop encoding time   : 0.000
0.19/0.37	#    Success case prop solver time     : 0.000
0.19/0.37	# Current number of processed clauses  : 24
0.19/0.37	#    Positive orientable unit clauses  : 8
0.19/0.37	#    Positive unorientable unit clauses: 0
0.19/0.37	#    Negative unit clauses             : 5
0.19/0.37	#    Non-unit-clauses                  : 11
0.19/0.37	# Current number of unprocessed clauses: 14
0.19/0.37	# ...number of literals in the above   : 28
0.19/0.37	# Current number of archived formulas  : 0
0.19/0.37	# Current number of archived clauses   : 17
0.19/0.37	# Clause-clause subsumption calls (NU) : 39
0.19/0.37	# Rec. Clause-clause subsumption calls : 36
0.19/0.37	# Non-unit clause-clause subsumptions  : 4
0.19/0.37	# Unit Clause-clause subsumption calls : 43
0.19/0.37	# Rewrite failures with RHS unbound    : 0
0.19/0.37	# BW rewrite match attempts            : 1
0.19/0.37	# BW rewrite match successes           : 1
0.19/0.37	# Condensation attempts                : 0
0.19/0.37	# Condensation successes               : 0
0.19/0.37	# Termbank termtop insertions          : 1017
0.19/0.37	
0.19/0.37	# -------------------------------------------------
0.19/0.37	# User time                : 0.029 s
0.19/0.37	# System time              : 0.004 s
0.19/0.37	# Total time               : 0.032 s
0.19/0.37	# Maximum resident set size: 1652 pages
0.19/0.37	EOF